The Syntax, Semantics, and Inference Mechanism of Natural Language

نویسنده

  • Francis Y. Lin
چکیده

It is both desirable and plausible to treat natural language itself as a "knowledge representation (KR) formalism. Every KR formalism has syntax and support certain inferences. The syntax of a KR formalism specifies the form in which knowledge must be encoded, and its inference mechanism depends on its syntax. If natural language is a formalism for representing knowledge, then its syntax provides specifications of well-formed formulae. In addition, reasoning must be done directly on the basis of syntax, as in any artificial KR scheme. In this respect, existing syntactic theories are inadequate, because syntax in these theories does not support reasoning. In this paper I present a new conception of the syntax, semantics, and inference mechanism of natural language. The central ideas are (1) that word use determines the forms of sentences, and (2) that these forms are used to express meaning and perform inference. Syntax, semantics, and inference are seen as an integrated whole, rather than separate and autonomous fields as in many existing studies of natural language.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Meaning to Learn: Bootstrapping Semantics to Infer Syntax

Context-free grammars cannot be identified in the limit from positive examples (Gold 1967), yet natural language grammars are more powerful than context-free grammars and humans learn them with remarkable ease from positive examples (Marcus 1993). Identifiability results for formal languages ignore a potentially powerful source of information available to learners of natural languages, namely, ...

متن کامل

Natural Language Syntax and First Order In

We have argued elsewhere that rst order inference can be made more eecient by using non-standard syntax for rst order logic. In this paper we deene a syntax for rst order logic based on the structure of natural language under Montague semantics. We show that, for a certain fairly expressive fragment of this language, satissability is polynomial time decidable. The polynomial time decision proce...

متن کامل

Natural Language Syntax and First-Order Inference

We have argued elsewhere that rst order inference can be made more eecient by using non-standard syntax for rst order logic. In this paper we deene a syntax for rst order logic based on the structure of natural language under Montague semantics. We show that, for a certain fairly expressive fragment of this language, satissability is polynomial time decidable. The polynomial time decision proce...

متن کامل

On the Relationship between Lexical Semantics and Syntax for the Inference of Context-Free Grammars

Context-free grammars cannot be identified in the limit from positive examples (Gold 1967), yet natural language grammars are more powerful than context-free grammars and humans learn them with remarkable ease from positive examples (Marcus 1993). Identifiability results for formal languages ignore a potentially powerful source of information available to learners of natural languages, namely, ...

متن کامل

Elf: A Meta-Language for Deductive Systems (System Descrition)

1 Overview Elf is a uniform metalanguage for the formalization of the theory of programming languages and logics. It provides means for 1. specifying the abstract syntax and semantics of an object language in a natural and direct way; 2. implementing related algorithms (e.g., for type inference, evaluation, or proof search); and 3. representing proofs of meta-theorems about an object language, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002